COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III
نویسندگان
چکیده
منابع مشابه
the analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولProblems and Results on Combinatorial Number Theory Iii
1 WROTE SEVERAL papers and review articles on this subject . One of them has in fact the same title (P. Erdős, Problems and results on combinatorial number theory, A survey of combinatorial theory, Edited by J. N. Srivastava, North Holland 1973, 117-138 . I will refer to this paper as 1). To prevent this paper from becoming too long I will avoid ovelap with I as much as possible and consider th...
متن کاملCombinatorial Problems on H-graphs
Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph H. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs. We continue the study of these graph classes by considering coloring, clique, and isomorphism problems on H-graphs. We show that for any fixed H conta...
متن کاملLower Bounds for Combinatorial Problems on Graphs
Nontrivial lower bounds are given for the computation time of various combinatorial problems on graphs under a linear or algebraic decision tree model. An SI( n310g n) bound is obtained for a “travelling salesman problem” on a weighted complete graph of n vertices. Moreover it is shown that the same bound is valid for the “subgraph detection problem” with respect to property P if P is hereditar...
متن کاملSome Combinatorial Problems on Halin Graphs
Let T be a tree with no degree 2 vertices and L(T) = {l1,. .. , lr}, r ≥ 2 denote the set of leaves in T. An Halin graph G is a graph obtained from T such that V (G) = V (T) and E(G) = E(T) ∪ {{li, li+1} | 1 ≤ i ≤ r − 1} ∪ {l1, lr}. In this paper, we investigate combinatorial problems such as, testing whether a given graph is Halin or not, chromatic bounds, an algorithm to color Halin graphs wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1956
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.42.8.529